Partitioning has always been a challenge in the design of distributed applications. It allows optimizing the intercommunication\nbetween the system components and so increasing the lifetime of the network. Graph theory methods have often been used to\nperform partitioning in classic distributed systems but seem to be not efficient in ad hoc or wireless sensor networks (WSN). The\nmain reason is related to the topology of these kinds of networks and the presence of multi hop communication. In this paper, we\npropose a new self-organisation of the WSN based on the optimization of the number of jumps between any sensor and the sink.\nThe network is based on a two-level hierarchy structure and organised as a set of clusters with one cluster-head by cluster and a\nsuper-leader for the entire network. The optimisation process has been performed and validated by introducing some parameters,\nbaptized cohesion parameters. The simulation of our approach compared to existing and previously developed protocols shows\nthe efficiency of the method. The results are very interesting and allow projecting several perspectives to improve performances by\nusing other metrics.
Loading....